Algorithms for weighted multi-tape automata
نویسندگان
چکیده
This report defines various operations and describes algorithms for weighted multi-tape automata (WMTAs). It presents, among others, a new approach to multi-tape intersection, meaning the intersection of a number of tapes of one WMTA with the same number of tapes of another WMTA, which can be seen as a generalization of transducer intersection. In our approach, multi-tape intersection is not considered as an atomic operation but rather as a sequence of more elementary ones. We show an example of multi-tape intersection, actually transducer intersection, that can be compiled with our approach but not with several other methods that we analyzed. Finally we describe an example of practical application, namely the preservation of intermediate results in transduction cascades. Kempe, Guingne, Nicart. Algorithms for n-Tape Automata. XRCE Report 2004 / 031 2
منابع مشابه
ar X iv : c s . C L / 0 40 60 03 v 1 2 J un 2 00 4 Algorithms for Weighted Multi - Tape Automata – XRCE Research Report 2004 / 031 – Andre Kempe
This report defines various operations and describes algorithms for weighted multi-tape automata (WMTAs). It presents, among others, a new approach to multi-tape intersection, meaning the intersection of a number of tapes of one WMTA with the same number of tapes of another WMTA, which can be seen as a generalization of transducer intersection. In our approach, multi-tape intersection is not co...
متن کاملNLP Applications Based on Weighted Multi-Tape Automata
This article describes two practical applications of weighted multi-tape automata (WMTAs) in Natural Language Processing, that demonstrate the augmented descriptive power of WMTAs compared to weighted 1-tape and 2-tape automata. The two examples concern the preservation of intermediate results in transduction cascades and the search for similar words in two languages. As a basis for these appli...
متن کاملMulti-tape Automata for Speech and Language Systems: A Prolog Implementation
This paper describes a Prolog implementation of multi-tape nite-state automata and illustrates its use with a rewrite rules system. Operators which are multi-tape speciic are deened and algorithms for constructing their behaviour into multi-tape machines are given.
متن کاملRevisiting Multi-Tape Automata for Semitic Morphological Analysis and Generation
Various methods have been devised to produce morphological analyzers and generators for Semitic languages, ranging from methods based on widely used finitestate technologies to very specific solutions designed for a specific language or problem. Since the earliest proposals of how to adopt the elsewhere successful finite-state methods to root-andpattern morphologies, the solution of encoding Se...
متن کاملEmbedding Multi-Hemirings into Semirings
Weighted languages and weighted automata over multi-hemirings are capable of expressing quantitative properties of systems such as its average or discounted costs. We study the applicability of well-known semiring theory and algorithms in the field of multi-hemirings. To this end, we embed multi-hemirings into semirings and extend this embedding for weighted languages and weighted automata. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره cs.CL/0406003 شماره
صفحات -
تاریخ انتشار 2004